Priority to the Furthest Behind

What is behind the Priority Heuristic ?

Comments on the article by E. Brandstätter, G. Gigerenzer, and R. Hertwig. The authors discuss the priority heuristic, a recent model for decisions under risk. They reanalyze the experimental validity of this approach and discuss how these results compare with cumulative prospect theory, the currently most established model in behavioral economics. They also discuss how general models for decis...

OFFPRINT The branch with the furthest reach

The Symmetric All-furthest- Neighbor Problem

Given a set 9 of n points on the plane, a symmerric_furfhesr-neighbor (SFN) pair of points p, q is one such that both p and q are furthest from each other among the points in 8. A pair of points is untipodal if it admits parallel lines of support. In this paper it is shown that a SFN pair of 9 is both a set of extreme points of 9 and an antipodul pair of 8. It is also shown that an asymmerricfu...

Approximate Furthest Neighbor with Application to Annulus Query

Much recent work has been devoted to approximate nearest neighbor queries. Motivated by applications in recommender systems, we consider approximate furthest neighbor (AFN) queries and present a simple, fast, and highly practical data structure for answering AFN queries in high-dimensional Euclidean space. The method builds on the technique of Indyk (SODA 2003), storing random projections to pr...

how to successfully leave behind the peer review process?

0